class Solution:
    def countOrders(self, n: int) -> int:
        k = 0
        now = 1
        base = 10 ** 9 + 7
        while k < n:
            next_val = (now * (2 * k + 1) * (k + 1)) % base
            now = next_val
            k += 1
        return now


data = Solution()
n = 3
print(data.countOrders(n))